A sub-feasible correction step for non-linear programming methods with equality constraints

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fully fuzzy linear programming with inequality constraints

Fuzzy linear programming problem occur in many elds such as mathematical modeling, Control theory and Management sciences, etc. In this paper we focus on a kind of Linear Programming with fuzzy numbers and variables namely Fully Fuzzy Linear Programming (FFLP) problem, in which the constraints are in inequality forms. Then a new method is proposed to ne the fuzzy solution for solving (FFLP). Nu...

متن کامل

Dis-equality Constraints in Linear/integer Programming

We have proposed an extension to the deenition of general integer linear programs (ILP) to accept dis-equality constraints explicitly. A new class of logical variables is introduced to transform the extended ILP in general form to standard form. Branch and Bound algorithm is modiied to solve this new class of ILP.

متن کامل

a new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot

abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...

15 صفحه اول

First step immersion in interval linear programming with linear dependencies

‎We consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals‎. ‎Contrary to classical models‎, ‎where parameters can attain any value from the interval domains independently‎, ‎we study problems with linear dependencies between the parameters‎. ‎We present a class of problems that are easily solved by reduction to the classi...

متن کامل

A New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints

Most research on bilevel linear programming problem  is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PAMM

سال: 2008

ISSN: 1617-7061,1617-7061

DOI: 10.1002/pamm.200810779